Fast and Exact Sequence Alignment with the Smith-Waterman Algorithm: The SwissAlign Webserver
نویسندگان
چکیده
It is demonstrated earlier that the exact Smith-Waterman algorithm yields more accurate results than the members of the heuristic BLAST family of algorithms. Unfortunately, the Smith-Waterman algorithm is much slower than the BLAST and its clones. Here we present a technique and a webserver that uses the exact SmithWaterman algorithm, and it is approximately as fast as the BLAST algorithm. The technique unites earlier methods of extensive preprocessing of the target sequence database, and CPU-specific coding of the Smith-Waterman algorithm. The SwissAlign webserver is available at the http://swissalign.pitgroup.org address.
منابع مشابه
gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملFast Sequence Alignment Method Using CUDA-enabled GPU
Sequence alignment is a task that calculates the degree of similarity between two sequences. Given a query sequence, finding a database sequence which is most similar to the query by sequence alignment is the first step in bioinformatics research. The first sequence alignment algorithm was proposed by Needleman and Wunsch. They got the optimal global alignment by using dynamic programming metho...
متن کاملLocal Sequence Alignment Against a Database Problem
Local Sequence Algignment. The local sequence alignment problem is defined as follows: Given two strings S = s 1. .. s n and T = t 1. .. t m , a substitution matrix Score and an insertion/deletion penalty δ, find a pair of substrings s i. .. s i+k of S and t j. .. t j+l of T that have the best overall alignment score, and return the best alignment for them. Local Sequence Algignment against a d...
متن کاملAn Integrated Approach to Fast, Sensitive, and Cost- Effective Smith-Waterman Multiple Sequence Alignment
Introduction Multiple Sequence Alignment (MSA) is a critical tool for phylogenetic analysis, homologous gene finding, and gene clustering. The most sensitive method for MSA was first described by SmithWaterman algorithm (SW) (1981) and improved by Gotoh (1982). The SW algorithm represents the degree of similarity between each pair of the sequences with a similarity score. A straightforward impl...
متن کاملFast and Complete Search of siRNA Off-target Sequences
Smith-Waterman alignment algorithm is favored in search for siRNA off-target instead of the BLAST algorithm, because BLAST tends to overlook some significant homologous sequences, especially when they are short (21 nt~27 nt). Smith-Waterman algorithm, however, suffers from its own shortcomings, especially its inefficiency in searching through a large sequence database. This paper presents a two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013